Decomposition dimension of corona product of some classes of graphs
نویسندگان
چکیده
For an ordered k-decomposition D = {G1, G2,...,Gk} of a connected graph G (V,E), the D-representation edge e is k-tuple γ(e/D)=(d(e, G1), d(e, G2), ...,d(e, Gk)), where Gi) represents distance from to Gi. A decomposition resolving if every two distinct edges have representations. The minimum k for which has its dimension dec(G). In this paper, corona product path Pn and cycle Cn with complete graphs K1 K2 are determined.
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملtotal vertex irregularity strength of corona product of some graphs
a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...
متن کاملstudying the corona product of graphs under some graph invariants
the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...
متن کاملComputing PI and Hyper–Wiener Indices of Corona Product of some Graphs
Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, i = 1, 2, …, |V(G)|. In this paper, we compute PI and hyper–Wiener indices of the corona product of graphs.
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones
سال: 2022
ISSN: ['0716-0917', '0717-6279']
DOI: https://doi.org/10.22199/issn.0717-6279-5466